Human-Driven Edge Computing and Communication: Part 2
نویسندگان
چکیده
منابع مشابه
Joint Computation and Communication Cooperation for Mobile Edge Computing
This paper proposes a novel joint computation and communication cooperation approach in mobile edge computing (MEC) systems, which enables user cooperation in both computation and communication for improving the MEC performance. In particular, we consider a basic three-node MEC system that consists of a user node, a helper node, and an access point (AP) node attached with an MEC server. We focu...
متن کاملHuman-driven application management at the Edge
The design and management of Edge systems will proactively involve human intelligence at the Edge, according to a human-driven approach that increases productivity and improves usability. Due to its ubiquity and heterogeneity, the Edge will give to application administrators a more decisional role in application deployment and resource management. Final decisions on where to distribute applicat...
متن کاملFeedback Loops in Communication and Human Computing
Building systems that are able to analyse communicative behaviours or take part in conversations requires a sound methodology in which the complex organisation of conversations is understood and tested on real-life samples. The data-driven approaches to human computing not only have a value for the engineering of systems, but can also provide feedback to the study of conversations between human...
متن کاملRisk Assessment Terminology: Risk Communication Part 2
The paper describes the terminology of risk communication in the view of food safety: different aspects of risk perception (perceived risk, media triggers, the psychometric paradigm, fright factors and cultural determinants of risk perception) are described. The risk profile elements are illustrated in the manuscript: hazard-food commodity combination(s) of concern; description of the public he...
متن کاملEdge 2-rainbow domination number and annihilation number in trees
A edge 2-rainbow dominating function (E2RDF) of a graph G is a function f from the edge set E(G) to the set of all subsets of the set {1,2} such that for any edge.......................
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Magazine
سال: 2018
ISSN: 0163-6804
DOI: 10.1109/mcom.2018.8291128